On the finite element approximation of solutions for radiation problem
نویسندگان
چکیده
منابع مشابه
A Nodal-based Finite Element Approximation of the Maxwell Problem Suitable for Singular Solutions
A new mixed finite element approximation of Maxwell’s problem is proposed, its main features being that it is based on a novel augmented formulation of the continuous problem and the introduction of a mesh dependent stabilizing term, which yields a very weak control on the divergence of the unknown. The method is shown to be stable and convergent in the natural H(curl; Ω) norm for this unknown....
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملQuadratic finite element approximation of the Signorini problem
Applying high order finite elements to unilateral contact variational inequalities may provide more accurate computed solutions, compared with linear finite elements. Up to now, there was no significant progress in the mathematical study of their performances. The main question is involved with the modeling of the nonpenetration Signorini condition on the discrete solution along the contact reg...
متن کاملFinite Element Approximation of the Parabolic Fractional Obstacle Problem
We study a discretization technique for the parabolic fractional obstacle problem in bounded domains. The fractional Laplacian is realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic equation posed on a semi-infinite cylinder, which recasts our problem as a quasi-stationary elliptic variational inequality with a dynamic boundary condition. The rapid decay of the solution suggest...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Analyse numérique
سال: 1983
ISSN: 0399-0516
DOI: 10.1051/m2an/1983170201951